Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness
نویسنده
چکیده
We present two modal typing systems with the approximation modality, which has been proposed by the author to capture selfreferences involved in computer programs and their speci cations. The systems are based on the simple and the F-semantics of types, respectively, and correspond to the same modal logic, which is considered the intuitionistic version of the logic of provability. We also show Kripke completeness of the modal logic and its decidability, which implies the decidability of type inhabitance in the typing systems.
منابع مشابه
A Completeness Result for BAN Logic
BAN logic is a propositional logic of knowledge for the verification of cryptographic protocols. While BAN logic has been successful from a practical point of view, the semantics of the epistemic (knowledge) modality is unclear. Several Kripke semantics have been proposed, but they do not attempt at anything beyond a soundness result. Completeness is prevented by the so called logical omniscien...
متن کاملA Simplified Proof of Arithmetical Completeness Theorem for Provability Logic GLP
We present a simplified proof of Japaridze’s arithmetical completeness theorem for the well-known polymodal provability logic GLP. The simplification is achieved by employing a fragment J of GLP that enjoys a more convenient Kripke-style semantics than the logic considered in the papers by Ignatiev and Boolos. In particular, this allows us to simplify the arithmetical fixed point construction a...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملHeyting-Brouwer Rough Set Logic
A rough set logic based on Heyting-Brouwer algebras HBRSL is proposed as a basis for reasoning about rough information. It is an extension of Düntsch’s logic with intuitionistic implication, and is seen as a variant of HeytingBrouwer logic. A Kripke semantics and natural deduction for the logic are presented and the completeness theorem is proved.
متن کاملSuzuki-type fixed point theorems for generalized contractive mappings that characterize metric completeness
Inspired by the work of Suzuki in [T. Suzuki, A generalized Banach contraction principle that characterizes metric completeness, Proc. Amer. Math. Soc. 136 (2008), 1861--1869], we prove a fixed point theorem for contractive mappings that generalizes a theorem of Geraghty in [M.A. Geraghty, On contractive mappings, Proc. Amer. Math. Soc., 40 (1973), 604--608]an...
متن کامل